Secret Sharing Schemes from a Class of Linear Codes over Finite Chain Ring ⋆
نویسندگان
چکیده
In general, every linear code can be used to construct a secret sharing scheme. However, determining the access structure of the secret sharing scheme based on a linear code is a very difficult problem. In this paper, we first construct a class of two-weight linear code over finite chain ring Fq[u]/⟨u⟩. Then, we present an access structure of the secret sharing scheme based on the two-weight linear code.
منابع مشابه
Two-weight and three-weight codes from trace codes over
We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring Fp+uFp+ vFp+uvFp, where u 2 = 0, v = 0, uv = vu. These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. With a linear Gray map, we obtain a class of abelian three-weight codes and two-weight codes...
متن کاملNew few weight codes from trace codes over a local Ring
In this paper, new few weights linear codes over the local ring R = Fp+uFp+vFp+uvFp, with u2 = v2 = 0, uv = vu, are constructed by using the trace function defined over an extension ring of degree m. These trace codes have the algebraic structure of abelian codes. Their weight distributions are evaluated explicitly by means of Gaussian sums over finite fields. Two different defining sets are ex...
متن کاملLinear code derived from the primage of quadratic function
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime power q, we construct some class of linear code over finite field Fq with defining set be the preimage of general quadratic form function and determine the explicit complete weight enumerators of the linear codes. Our construction cover all the corresponding result with quadra...
متن کاملThree-weight codes and the quintic construction
We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring R = F2 + vF2 + v 2 F2 + v 3 F2 + v 4 F2, where v 5 = 1. The same ring occurs in the quintic construction of binary quasi-cyclic codes. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using character sums. Given a linear Gray map, we obtain th...
متن کاملA class of three-weight and five-weight linear codes
Abstract Recently, linear codes with few weights have been widely studied, since they have applications in data storage systems, communication systems and consumer electronics. In this paper, we present a class of three-weight and five-weight linear codes over Fp, where p is an odd prime and Fp denotes a finite field with p elements. The weight distributions of the linear codes constructed in t...
متن کامل